3-Dimensional Lattice Polytopes Without Interior Lattice Points
نویسندگان
چکیده
A theorem of Howe states that every 3-dimensional lattice polytope P whose only lattice points are its vertices, is a Cayley polytope, i.e. P is the convex hull of two lattice polygons with distance one. We want to generalize this result by classifying 3-dimensional lattice polytopes without interior lattice points. The main result will be, that they are up to finite many exceptions either Cayley polytopes or there is a projection, which maps the polytope to the double unimodular 2-simplex. To every such polytope we associate a smooth projective surface of genus 0.
منابع مشابه
Projecting Lattice Polytopes Without Interior Lattice Points
We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d− 1)-dimensional lattice polytope without interior lattice points. This was conjectured by Treutlein. As an immediate corollary, we get a short proof of a recent result of Averkov, Wagner &Weismantel, namely the fi...
متن کاملNotes on the Roots of Ehrhart Polynomials
We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n , where n is the dimension. This improves on the previously best known bound n and complements a recent result of Braun [8] where it is shown that the norm of a root of a Ehrhart po...
متن کاملClassifications and volume bounds of lattice polytopes
In this licentiate thesis we study relations among invariants of lattice polytopes, with particular focus on bounds for the volume. In the first paper we give an upper bound on the volume vol(P∗) of a polytope P∗ dual to a d-dimensional lattice polytope P with exactly one interior lattice point, in each dimension d . This bound, expressed in terms of the Sylvester sequence, is sharp, and is ach...
متن کاملun 2 00 3 A Closer Look at Lattice Points in Rational Simplices 1
We generalize Ehrhart’s idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+ 1 rational vertices, we use its description as the intersection of n+1 halfspaces, which determine the facets of the simplex. Instead of just a single dilation factor, we allow different dilation factors for each of these facets. We g...
متن کاملA Closer Look at Lattice Points in Rational Simplices
We generalize Ehrhart’s idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+ 1 rational vertices, we use its description as the intersection of n+ 1 halfspaces, which determine the facets of the simplex. Instead of just a single dilation factor, we allow different dilation factors for each of these facets. We ...
متن کامل